Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
نویسندگان
چکیده
منابع مشابه
A bin packing reformulation and matheuristics for the unrelated parallel machines scheduling problem with resources
This short paper studies a parallel machines scheduling problem with the consideration of resources. Each job needs a number of resources at each machine for its completion. The objective studied is the minimization of the makespan. We model this problem by means of two integer linear programming problems. One of them is based on a model previously proposed in the literature, whereas the other ...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملApproximation of the parallel machine scheduling problem with additional unit resources
We consider the problem of minimizing the makespan of a schedule on m parallel machines of n jobs, where each job requires exactly one of s additional unit resources. This problem collapses to P ||Cmax if every job requires a different resource. It is therefore NP-hard even if we fix the number of machines to 2 and strongly NP-hard in general. Although very basic, its approximability is not kno...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2017
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2017.01.002